Observability Through a Matrix-Weighted Graph
نویسندگان
چکیده
منابع مشابه
A Novel Molecular Descriptor Derived from Weighted Line Graph
The Bertz indices, derived by counting the number of connecting edges of line graphs of a molecule were used in deriving the QSPR models for the physicochemical properties of alkanes. The inability of these indices to identify the hetero centre in a chemical compound restricted their applications to hydrocarbons only. In the present work, a novel molecular descriptor has been derived from the w...
متن کاملDrawing Weighted Directed Graph from It's Adjacency Matrix
This paper proposes an algorithm for buUdmg weighted directed graph,defmes the weighted directed relationship matrix of the graph,an d describes algorithm implementation using this matrix.Based on this algorithm ,an effective way for building an d drawing weighted directed graphs is presented,forming a foundation for visual implementation of the algorithm in the graph theory.
متن کاملA Weighted Planar Graph Separator
Given a weighted planar graph, we construct a simple separating cycle C whose interior and exterior both weigh at most 2/3 of the total weight. The cycle C uses k jumps across the faces and ordinary edges with cost O(1=k) of the total edge cost. This theorem is the main component of a PTAS for the weighted TSP problem 4].
متن کاملGraph Matrix Completion in Presence of Outliers
Matrix completion problem has gathered a lot of attention in recent years. In the matrix completion problem, the goal is to recover a low-rank matrix from a subset of its entries. The graph matrix completion was introduced based on the fact that the relation between rows (or columns) of a matrix can be modeled as a graph structure. The graph matrix completion problem is formulated by adding the...
متن کاملObservability analysis for networked control systems: a graph theoretic approach
This paper deals with the state and input observability analysis for Networked Control Systems which are composed of interconnected subsystems that exchange data through communication networks. The proposed method is based on a graph-theoretic approach and assumes only the knowledge of the system’s structure. More precisely, for the so-called distributed decentralized and distributed autonomous...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2018
ISSN: 0018-9286,1558-2523,2334-3303
DOI: 10.1109/tac.2017.2758172